Locating Matches of Tree Patterns in ForestsAndreas Neumann
نویسندگان
چکیده
Electronic copies of technical reports are available: Via FTP: Host ftp.informatik.uni-trier.de, directory /pub/reports Via gopher: Host gopher.informatik.uni-trier.de, port 70, type 1, pathes 1/TechReports/Abstracts and 1/TechReports/FullText Via WWW: URL http://www.informatik.uni-trier.de/Reports/List Via email: Send a mail to [email protected], subject ’MAIL ME CLEAR’, body ’TechReports.HowTo’ followed by an empty line, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
منابع مشابه
Locating Matches of Tree Patterns in ForestsAndreas Neumann and Helmut
Electronic copies of technical reports are available: Via FTP: Host ftp.informatik.uni-trier.de, directory /pub/reports Via gopher: Host gopher.informatik.uni-trier.de, port 70, type 1, pathes 1/TechReports/Abstracts and 1/TechReports/FullText Via WWW: URL http://www.informatik.uni-trier.de/Reports/List Via email: Send a mail to [email protected], subject ’MAIL ME CLEAR’, body...
متن کاملLocating Matches of Tree Patterns in Forests
We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest a...
متن کاملThe 2-dimension of a Tree
Let $x$ and $y$ be two distinct vertices in a connected graph $G$. The $x,y$-location of a vertex $w$ is the ordered pair of distances from $w$ to $x$ and $y$, that is, the ordered pair $(d(x,w), d(y,w))$. A set of vertices $W$ in $G$ is $x,y$-located if any two vertices in $W$ have distinct $x,y$-location.A set $W$ of vertices in $G$ is 2-located if it is $x,y$-located, for some distinct...
متن کاملFMtree: a fast locating algorithm of FM-indexes for genomic data
Motivation As a fundamental task in bioinformatics, searching for massive short patterns over a long text has been accelerated by various compressed full-text indexes. These indexes are able to provide similar searching functionalities to classical indexes, e.g. suffix trees and suffix arrays, while requiring less space. For genomic data, a well-known family of compressed full-text indexes, cal...
متن کاملنقش درخت زندگی در فرش های ترکمنی (با تاکید بر نقوش درخت در فرهنگ اسلامی و تمدن های باستانی)
In Islam the “Tree of Life” is named as Sedreh or Tuba and the followers of Islam believe that this tree is grown in Heaven; therefore it is an interesting subject for artistic innovative. In Turkmen terminology “tree of life” is called “Yashaish bagh”. In this study we have made an effort to evaluate the symbol of the Tree and the “Tree of Life”,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998